Planar geometric location problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discretization of Planar Geometric Cover Problems

We consider discretization of the ‘geometric cover problem’ in the plane: Given a set P of n points in the plane and a compact planar object T0, find a minimum cardinality collection of planar translates of T0 such that the union of the translates in the collection contains all the points in P . We show that the geometric cover problem can be converted to a form of the geometric set cover, whic...

متن کامل

Planar Location Problems with Line Barriers

The Weber Problem for a given nite set of existing facilities Ex = fEx 1 ; Ex 2 ; : : : ; Ex M g IR 2 with positive weights w m (m = 1; : : : ; M) is to nd a new facility X such that P M m=1 w m d(X; Ex m) is minimized for some distance function d. A variation of this problem is obtained if the existing facilities are situated on two sides of a linear barrier. Such barriers like rivers, highway...

متن کامل

Min-max-min Geometric Facility Location Problems

We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...

متن کامل

Planar Polarity: Location, Location, Location

Recent studies have shown that many proteins that regulate planar polarity in the fly eye are organized into discrete membrane sites which may be crucial for coordinating groups of cells.

متن کامل

Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions

The goal of this paper is to show that the concept of the shortest path inside a polygonal region contributes to the design of eecient algorithms for certain geometric optimization problems involving simple polygons: computing optimum separators, maximum area or perimeter inscribed triangles, a minimum area circumscribed concave quadrilateral, or a maximum area contained triangle. The structure...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 1994

ISSN: 0178-4617,1432-0541

DOI: 10.1007/bf01182774